An Algorithm for Pronominal Anaphora Resolution
نویسندگان
چکیده
∗ School of Oriental and African Studies, University of London, London WC1H OXG, UK. E-mail: [email protected]. Most of the first author's work on this paper was done while he was a Research Staff Member in the Computer Science Department of the IBM T.J. Watson Research Center † Sietec Systemtechnik (Siemens AG), D-13623 Berlin, Germany. E-mail: [email protected] The second author’s work on this paper was done while he was a visiting scientist at the IBM Germany Scientific Center. This paper presents an algorithm for identifying the noun phrase antecedents of third person pronouns and lexical anaphors (reflexives and reciprocals). The algorithm applies to the syntactic representations generated by McCord's Slot Grammar parser, and relies on salience measures derived from syntactic structure and a simple dynamic model of attentional state. Like the parser, the algorithm is implemented in Prolog. The authors have tested it extensively on computer manual texts, and conducted a blind test on manual text containing 360 pronoun occurrences. The algorithm successfully identifies the antecedent of the pronoun for 86% of these pronoun occurrences. The relative contributions of the algorithm's components to its overall success rate in this blind test are examined. Experiments were conducted with an enhancement of the algorithm which contributes statistically modelled information concerning semantic and real world relations to the algorithm's decision procedure. Interestingly, this enhancement only marginally improves the algorithm's performance (by 2%). The algorithm is compared with other approaches to anaphora resolution which have been proposed in the literature. In particular, the search procedure of Hobbs' algorithm was implemented in the Slot Grammar framework and applied to the sentences in the blind test set. The authors' algorithm achieves a higher rate of success (4%) than Hobbs' algorithm. The relation of the algorithm to the centering approach is discussed, as well as to models of anaphora resolution which invoke a variety of informational factors in ranking antecedent candidates.
منابع مشابه
Pronominal and Sortal Anaphora Resolution for Biomedical Literature
Anaphora resolution is one of essential tasks in message understanding. In this paper resolution for pronominal and sortal anaphora, which are common in biomedical texts, is addressed. The resolution was achieved by employing UMLS ontology and SA/AO (subject-action/action-object) patterns mined from biomedical corpus. On the other hand, sortal anaphora for unknown words was tackled by using the...
متن کاملExploring Semantic Information from Hindi Dependency Treebank for Resolving Pronominal Anaphora
Anaphora Resolution is exigent task in almost all NLP applications such as text summarization, machine translation, information extraction, question-answering systems, etc. A lot of work has been done for identifying and still more need to be done for finding the factors responsible for resolving the anaphoras in all languages. An attempt has been made to resolve Hindi pronominal anaphora using...
متن کاملResolution of Pronominal Anaphora for Telugu Dialogues
The challenge of anaphora resolution has been taken up from long time. However, most of the work did not include for dialogues. In this paper we discuss the types of pronouns and anaphora in Telugu language and make an attempt to build a rule based pronominal anaphora resolution algorithm for human to human conversations. The model mainly consists of two parts, creating a knowledge base with a ...
متن کاملA Computational Model for Resolving Pronominal Anaphora in Turkish Using Hobbs' Naïve Algorithm
he this himself o bu kendi she that herself onu bunu kendisi it these itself onun bunun kendim his those themselves onlar bunlar kendin her others onları bunları kendimiz him onların bunların kendiniz its şu kendileri they şunu them şunun their şunlar şunları şunların Pronominal Anaphora in English Pronominal Anaphora in Turkish Abstract—In this paper we present a computational model for pronom...
متن کاملA Computational Model for Resolving Pronominal Anaphora in Turkish Using Hobbs- Naïve Algorithm
he this himself o bu kendi she that herself onu bunu kendisi it these itself onun bunun kendim his those themselves onlar bunlar kendin her others onları bunları kendimiz him onların bunların kendiniz its şu kendileri they şunu them şunun their şunlar şunları şunların Pronominal Anaphora in English Pronominal Anaphora in Turkish Abstract—In this paper we present a computational model for pronom...
متن کاملPronominal Reference Type Identification and Event Anaphora Resolution for Hindi
In this paper, we present hybrid approaches for pronominal reference type (abstract or concrete) identification and event anaphora resolution for Hindi. Pronominal reference type identification is one of the important parts for any anaphora resolution system as it helps anaphora resolver in optimal feature selection based on pronominal reference types. We use language specific rules and feature...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computational Linguistics
دوره 20 شماره
صفحات -
تاریخ انتشار 1994